Efficient Recommendation of Aggregate Data Visualizations
نویسندگان
چکیده
منابع مشابه
Efficient Aggregate Queries on Data Cubes
As computers are developing rapidly and become more available to the modern information society, the possibility and ability to handle large data sets in database applications increases. The demand for efficient algorithmic solutions to process huge amounts of information increases as the data sets become larger. In this thesis, we study the efficient implementation of aggregate operations on t...
متن کاملEfficient Computation of Data Cubes and Aggregate Views
This paper reviews the main techniques for the efficient calculation of aggregate multidimensional views and data cubes, possibly using specifically designed indexing structures. The efficient evaluation of aggregate multidimensional queries is obviously one of the most important aspects in data warehouses (OLAP systems). In particular, a fundamental requirement of such systems is the ability t...
متن کاملEfficient Dissemination of Aggregate Data over the Wireless Web
The proliferation of wireless technologies along with the large volume of data available online are forcing us to re think existing data dissemination techniques for data over the Web and in particular for aggregate data In addition to scalability and response time data delivery to mobile clients with wireless Web connectivity must also consider energy consumption In this work we present a hybr...
متن کاملEfficient Execution of Range-Aggregate Queries in Data Warehouse Environments
Range-aggregate queries on the data cube are powerful tools for analysis in data warehouse environments. Cubetree is a technique materializing a data cube through an R-tree. It provides efficient data accessibility, but involves some drawbacks to traverse all the internal and leaf nodes within given query ranges to compute range-aggregate queries. In this paper, we propose a novel index structu...
متن کاملProbDB: Efficient Execution of Aggregate Queries over Probabilistic Data
Les requêtes d’agrégats sont essentielles dans de nombreuses applications qui gèrent des données incertaines. Cependant, calculer de manière efficace ces requêtes est généralement difficile. Dans cette démonstration nous présentons ProbDB, un système de gestion de bases de données probabilistes. Nous montrons en particulier l’efficacité de ProbDB lors du calcul de requêtes avec agrégats tels qu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Knowledge and Data Engineering
سال: 2018
ISSN: 1041-4347
DOI: 10.1109/tkde.2017.2765634